Priority queueing systems: from probability generating functions to tail probabilities
نویسندگان
چکیده
منابع مشابه
Priority queueing systems: from probability generating functions to tail probabilities
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to invert probability generating functions, since most important distributions in discrete-time queueing systems can be determined in the form of probability generating functions. In this paper, we calculate the tail probabil...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملConverting Observed Likelihood Functions to Tail Probabilities
The chi-square approximation for likelihood drop is widely used but may be inaccurate for small or medium sized samples; mean and variance corrections may help. The Lugannani and Rice tail probability formula provides high accuracy based on a cumulant generating function, which is readily available for exponential family models. This paper surveys extensions of this formula to more general cont...
متن کاملmodelling and analysis of a discrete-time priority queuing computer network with priority jumps using probability generating functions
priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. the discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. on the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2006
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-006-9003-8